A verifiable low-level concurrent programming model based on colored Petri nets

Timed Colored Petri Nets Based

Abstract: Aero-engines maintenance procedure can be treated as a typical discrete event dynamic system. A theory that synthesized timed colored Petri net is proposed. The theory adopts a bottom-up approach by merging all sub modules, and each one characterizes the critical resource contention among processes. Nevertheless Petri net seems inapplicable to dynamic scheduling modelling because of i...

Web Service Automatic Composition Model Based on Colored Petri Nets

As the capability of an individual Web service is limited, it’s necessary to create new functionalities with existing Web services. Web services composition is the ability to create a new value-added service by incorporating some existing web services together. A model based colored Petri net (CPN) to provide semantic support for web service composition is proposed. The basic composite construc...

A Note on Colored Petri Nets

Modeling Reusable Concurrent Passive Entity Objects in Colored Petri Nets

Concurrent software systems are growing increasingly large and complex; the risks associated with poor design and architectural choices are increasing as well. Building executable prototypes can help identify problems early and Colored Petri Nets are well suited to this purpose. This paper presents an approach to modeling reusable threadsafe passive entity objects in Colored Petri Nets, includi...

A method of workflow scheduling based on colored Petri nets

Article history: Received 14 September 2010 Received in revised form 15 November 2010 Accepted 15 November 2010 Available online 24 November 2010 Effective methods of workflow scheduling can improve the performance of workflow systems. Based on the study of existing scheduling methods, a method of workflow scheduling, called phasedmethod, is proposed. This method is based on colored Petri nets....